Planning to Achieve Goals References and Utility
نویسندگان
چکیده
Goals, as typically conceived in AI planning, provide an insufficient basis for choice of action, and hence are deficient as the sole expression of an agent’s objectives. Decision-theoretic utilities offer a more adequate basis, yet lack many of the computational advantages of goals. We provide a preferential semantics for goals that grounds them in decision theory and preserves the validity of some, but not all, common goal operations performed in planning. This semantic account provides a criterion for verifying the design of goal-based planning strategies, thus providing a new framework for knowledge-level analysis of planning systems. Planning to achieve goals In the predominant AI planning paradigm, planners construct plans designed to produce states satisfying particular conditions called goals. Each goal represents a partition of possible states of the world into those satisfying and those not satisfying the goal. Though planners use goals to guide their reasoning, the crude binary distinctions defined by goals provide no basis for choosing among alternative plans that ensure achievement of goals, and no guidance whatever when no such plans can be found. These lacunae pose significant problems for planning in all realistic situations, where actions have uncertain effects or objectives can be partially satisfied. To overcome these widely-recognized expressive limitations of goals, many AI planners make ud hoc use of heuristic evaluation functions. These augment the guidance provided by goals, but lack the semantic justification needed to evaluate their true efficacy. We believe that heuristic evaluation functions should not be viewed as mere second-order refinements on the primary goal-based representation of objectives, supporting a separate “optimizing” phase of planning. Our thesis is that relative preference over the possible results of a plan constitutes the fundamental concept underlying the objectives of planning, with goals serv*Jon Doyle is supported by the USAF Rome Laboratory and DARPA under contract F30602-91-C-0018. Jon Doyle* MIT Lab for Computer Science 545 Technology Square
منابع مشابه
Soft Goals Can Be Compiled Away
Soft goals extend the classical model of planning with a simple model of preferences. The best plans are then not the ones with least cost but the ones with maximum utility, where the utility of a plan is the sum of the utilities of the soft goals achieved minus the plan cost. Finding plans with high utility appears to involve two linked problems: choosing a subset of soft goals to achieve and ...
متن کاملComparison of the deterministic and fuzzy approaches in HR planning
Supplying required human resource is one of the strategic goals of an organization. Therefore, organizations plan and predict the required human resources in order to prevent this problem. Present study using practical approach seeks to assist organizations to achieve their various goals in human resources planning. The designed model in this study clarifies vague, inaccurate, and fuzzy exp...
متن کاملارائه مدلی یکپارچه برای ارزیابی و انتخاب تامین کنندگان بر مبنای زیان معیارها و ساختار ترجیجی تصمیم گیرنده
Selecting the right suppliers is one of the most important decision-making problems to achieve competitive advantage in the supply chain of every company and organization. In order to achieve these goals, the decision-makers (DMs) should apply the best method and accurate criteria for analyzing and solving supplier selection problems. Meanwhile, due to their flexibility, the use of hybrid model...
متن کاملComparison of the deterministic and fuzzy approaches in HR planning
Supplying required human resource is one of the strategic goals of an organization. Therefore, organizations plan and predict the required human resources in order to prevent this problem. Present study using practical approach seeks to assist organizations to achieve their various goals in human resources planning. The designed model in this study clarifies vague, inaccurate, and fuzzy exp...
متن کاملPartial Satisfaction Planning: Representation and Solving Methods
Automated planning problems classically involve finding a sequence of actions that transform an initial state to some state satisfying a conjunctive set of goals with no temporal constraints. But in many real-world problems, the best plan may involve satisfying only a subset of goals or missing defined goal deadlines. For example, this may be required when goals are logically conflicting, or wh...
متن کامل